An interior-point method for large constrained discrete ill-posed problems
نویسندگان
چکیده
Ill-posed problems are numerically underdetermined. It is therefore often beneficial to impose known properties of the desired solution, such as nonnegativity, during the solution process. This paper proposes the use of an interior-point method in conjunction with truncated iteration for the solution of large-scale linear discrete ill-posed problems with box constraints. An estimate of the error in the data is assumed to be available. Numerical examples demonstrate the competitiveness of this approach.
منابع مشابه
An Interior-Point Trust-Region-Based Method for Large-Scale Nonnegative Regularization
We present a new method for large-scale nonnegative regularization, based on a quadratically and nonnegatively constrained quadratic problem. Such problems arise for example in the regularization of ill-posed problems in image restoration where, in addition, some of the matrices involved are very ill-conditioned. The method is an interior-point iteration that requires the solution of a large-sc...
متن کاملInterior point methods for ill-posed problems: A primal-dual solver for the box-constrained inverse conductivity problem
This paper explores the utility of interior point methods in solving box-constrained nonlinear ill-posed problems. In this context we investigate the implementation of a primal-dual Newton algorithm based on the logarithmic barrier function to solve the inverse electrical conductivity problem when the upper and lower bounds on the parameters of interest are known a priori. The proposed techniqu...
متن کاملThe structure of iterative methods for symmetric linear discrete ill-posed problems
The iterative solution of large linear discrete ill-posed problems with an error contaminated data vector requires the use of specially designed methods in order to avoid severe error propagation. Range restricted minimal residual methods have been found to be well suited for the solution of many such problems. This paper discusses the structure of matrices that arise in a range restricted mini...
متن کاملA Hybrid Multilevel-active Set Method for Large Box-constrained Linear Discrete Ill-posed Problems
Many questions in science and engineering give rise to linear ill-posed problems, whose solution is known to satisfy box constraints, such as nonnegativity. The solution of discretized versions of these problems is highly sensitive to perturbations in the data, discretization errors, and round-off errors introduced during the computations. It is therefore often beneficial to impose known constr...
متن کاملA Hybrid Multilevel-active Set Method for Large Box-constrained Discrete Ill-posed Inverse Problems
Many questions in science and engineering give rise to ill-posed inverse problems whose solution is known to satisfy box constrains, such as nonnegativity. The solution of discretized versions of these problems is highly sensitive to perturbations in the data, discretization errors, and round-off errors introduced during the computations. It is therefore often beneficial to impose known constra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Computational Applied Mathematics
دوره 233 شماره
صفحات -
تاریخ انتشار 2010